Behavioral adaptation to fixed-interval and fixed-time food delivery in golden hamsters1
نویسندگان
چکیده
منابع مشابه
Interval timing under a behavioral microscope: Dissociating motivational and timing processes in fixed-interval performance.
The distribution of latencies and interresponse times (IRTs) of rats was compared between two fixed-interval (FI) schedules of food reinforcement (FI 30 s and FI 90 s), and between two levels of food deprivation. Computational modeling revealed that latencies and IRTs were well described by mixture probability distributions embodying two-state Markov chains. Analysis of these models revealed th...
متن کاملFixed Interval Smoothing for Nonlinear Continuous Time Systems
Here, dr~dr and dw/dt are independent, zero mean, ganssian white noise processes, with covariances I 3 ( t r ) and R ( t ) 8 ( t T), respectively. The matrix R(t) is positive definite for all t. An a priori distribution for the density of x 0 is assumed known, and it is assumed that f , G, h and R all have sufficient smoothness properties to guarantee the usual existence and uniqueness requirem...
متن کاملTime-fixed geometry of 2nd order ODEs
Abstract : Let be a 2nd order ODE. By Cartan equivalence method, we will study the local equivalence problem under the transformations group of time-fixed coordinates. We are going to solve this problem by an applicable method which has been recognized by R. Gardner, and classify them.
متن کاملInterval censored regression with fixed effects
This paper considers estimation of a fixed-effects model with an interval-censored dependent variable. In each time period, the researcher observes the interval (with known endpoints) in which the dependent variable lies but not the value of the dependent variable itself. Two versions of the model are considered, a parametric model with logistic errors and a semiparametric model with errors hav...
متن کاملInterval Completion Is Fixed Parameter Tractable
We present an algorithm with runtime O(knm) for the following NP-complete problem [9, problem GT35]: Given an arbitrary graph G on n vertices and m edges, can we obtain an interval graph by adding at most k new edges to G? This resolves the long-standing open question [17, 7, 25, 14], first posed by Kaplan, Shamir and Tarjan, of whether this problem was fixed parameter tractable. The problem ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Experimental Analysis of Behavior
سال: 1977
ISSN: 0022-5002
DOI: 10.1901/jeab.1977.27-33